package uk.org.landeg.euler.problems.unported;

/**
 * find all values below 150,000,000 where:
 * n^2 + 1
 * n^2 + 3
 * n^2 + 7
 * n^2 + 9
 * n^2 + 13
 * n^2 + 27
 * are consecutive primes.
 * 
 * @author Andy
 *
 */
public class Euler146 extends AbstractProblem {
	@Override
	public String solve() {
		return null;
	}
}
